Multiplicative congruential random number generators with modulus $2\sp \beta$: an exhaustive analysis for $\beta=32$ and a partial analysis for $\beta=48$
نویسندگان
چکیده
منابع مشابه
Some Notes On Multiplicative Congruential Random Number Generators With Mersenne Prime Modulus 261-1
Multiplicative congruential random number generators of the form sn = a*Sn_i mod m using the Mersenne prime modulus 2-1 are examined. Results show that they can provide sufficiently long pseudo-random sequences that can be implemented efficiently using 64 bit accumulators without the need of a costly division operation. INTRODUCTION Random number generators are widely used in computer simulatio...
متن کاملCriterion of Spectral Test for Linear Congruential Random Number Generators
The criterion issue of spectral test in a linear congruential random number generator is considered. In this paper, we report on four variants of the normalized spectral test, measured both relative to either a theoretical or exact lower bound and aggregative to either a worst-case or average-case method. Computer exhaustive searches are conducted to evaluate and compare their statistical behav...
متن کاملAn exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
This paper presents results of an exhaustive computer search for the maximum spectral value in full period two-term kth-order multiple recursive generators (MRGs) with efficient multipliers. For orders k = 2, 3, . . . , 7, we provide a table of kth-order MRGs with largest spectral values. These MRGs not only have the best spectral values found so far but also can be implemented efficiently by a...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1990
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1990-0993929-9